The Performance of Subspace Algorithm Cointegration Analysis: A Simulation Study

This paper presents a simulation study that assesses the finite sample performance of the subspace algorithm cointegration analysis developed in Bauer and Wagner (2002b). The method is formulated in the state space framework, which is equivalent to the VARMA framework, in a sense made precise in the paper. This implies applicability to VARMA processes. The paper proposes and compares six different tests for the cointegrating rank. The simulations investigate four issues: the order estimation, the size performance of the proposed tests, the accuracy of the estimation of the cointegrating space and the forecasting performance. The simulations are performed on a set of trivariate processes with cointegrating ranks ranging from zero to three as well as on processes of output dimension four and cointegrating rank two. We analyze the influence of the sample size on the results as well as the sensitivity of the results with respect to stable poles approaching the unit circle. All results are compared to benchmark results obtained by applying the Johansen procedure on VAR models fitted to the data. The simulations show advantages of subspace algorithm cointegration analysis for the small sample performance of the tests for the cointegrating rank in many cases. However, we find that the accuracy of the subspace algorithm based estimation of the cointegrating space is unsatisfactory for the four-dimensional simulated systems. The forecasting performance is grosso modo comparable to the results obtained by applying the Johansen methodology on VAR approximations, although for very small sample sizes the forecasts based on VAR approximations outperform the subspace forecasts. The appendix provides critical values for the test statistics. JEL Classification: C13, C32